Domain search using shrunken images for fractal image compression
نویسندگان
چکیده
منابع مشابه
Hybrid Fractal Image Compression for Satellite Images
9 Abstract— In this paper, we present a hybrid fractal image compression method for satellite images. The proposed algorithm uses entropy and arithmetic coding. The satellite image is decomposed into low frequency sub-band and high frequency sub-band. The low frequency sub-band uses fractal coding, thus making the low-frequency information loss less which is sensitive to human visual system. ...
متن کاملFast Search Strategies for Fractal Image Compression
In traditional fractal image compression, the encoding procedure is time-consuming due to the full search mechanism. In order to speedup the encoder, we adopt particle swarm optimization method performed under classification and Dihedral transformation to further decrease the amount of MSE computations. The classifier partitions all of the blocks in domain pool and range pool into three classes...
متن کاملLean domain pools for fractal image compression
In fractal image compression an image is partitioned into ranges for each of which a similar subimage, called domain, is selected from a pool of subimages. A typical choice for the domain pool may consist of all square subimages of a particular size. However, only a fraction of this large pool is actually used in the fractal code. This subset can be characterized in two related ways: (1) It con...
متن کاملDynamic Domain Classification for Fractal Image Compression
Fractal image compression is attractive except for its high encoding time requirements. The image is encoded as a set of contractive affine transformations. The image is partitioned into non-overlapping range blocks, and a best matching domain block larger than the range block is identified. There are many attempts on improving the encoding time by reducing the size of search pool for range-dom...
متن کاملRegion-based Fractal Image Compression using Deterministic Search
The paper introduces a new method based on deterministic search to fractal image compression. In order to find a good region-based partitioning, we propose a deterministic search method for finding the blocks to be merged. For each range, a list of best N domains is maintained. When two ranges are to be merged and their common edge disappears, for the new range the best N domains are selected o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2005
ISSN: 0916-7005,1868-937X
DOI: 10.1007/bf03167438